Sheet-Metal Shop Scheduling Considering Makespan and Flow Time Criteria

نویسندگان

  • H. Crauwels
  • B. Verlinden
  • D. Cattrysse
چکیده

Sheet-metal parts typically follow a unidirectional flow in the sheet-metal shop. In the first cutting stage, a large sheet is cut to different unfolded parts with a laser cutting machine. To avoid waste material different parts are combined on a sheet. Next, the 2D parts are transformed to 3D products with air bending. In this bending stage, timeconsuming set-ups between production layouts are reduced as much as possible. Separate optimisation of cutting and air bending causes the optimisation benefits to counteract one another. Integrated models have been proposed for both singleand multiple-machine classes, but calculation times are too high and avoidable changeovers still occur. In this paper, by applying variable neighbourhood search with a number of different starting solutions, local optima of good quality are determined for minimising the makespan and the total flow time for both the single-machine and the multi-machine classes. Because the two performance measures are important for a good production plan, bicriteria optimisation by means of a simultaneous and a hierarchical approach, is also considered. Compared to the mathematical programming models for the combined cutting and bending operations, both quality and required computation time are improved for several real-life instances.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Mathematical Model for a Flow Shop Scheduling Problem with Fuzzy Processing Times

This paper presents a mathematical model for a flow shop scheduling problem consisting of m machine and n jobs with fuzzy processing times that can be estimated as independent stochastic or fuzzy numbers. In the traditional flow shop scheduling problem, the typical objective is to minimize the makespan). However,, two significant criteria for each schedule in stochastic models are: expectable m...

متن کامل

Minimizing the maximum tardiness and makespan criteria in a job shop scheduling problem with sequence dependent setup times

The job shop scheduling problem (JSP) is one of the most difficult problems in traditional scheduling because any job consists of a set operations and also any operation processes by a machine. Whereas the operation is placed in the machine, it is essential to be considering setup times that the times strongly depend on the various sequencing of jobs on the machines. This research is developed ...

متن کامل

Minimizing Makespan with Start Time Dependent Jobs in a Two Machine Flow Shop

[if gte mso 9]> The purpose of this paper is to consider the problem of scheduling a set of start time-dependent jobs in a two-machine flow shop, in which the actual processing times of jobs increase linearly according to their starting time. The objective of this problem is to minimize the makespan. The problem is known to be NP-hardness[ah1] ; therefore, there is no polynomial-time algorithm...

متن کامل

An Efficient Ant Colony Optimization Algorithm for Multiobjective Flow Shop Scheduling Problem

In this paper an ant colony optimization algorithm is developed to solve the permutation flow shop scheduling problem. In the permutation flow shop scheduling problem which has been vastly studied in the literature, there are a set of machines and a set of jobs. All the jobs are processed on all the machines and the sequence of jobs being processed is the same on all the machines. Here this pro...

متن کامل

Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems

Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010